Profitable Scheduling on Multiple Speed-Scalable Processors
نویسندگان
چکیده
منابع مشابه
Scalable Scheduling in Parallel Processors
A study of scalable data intensive scheduling involving load distribution on multi-level fat tree networks is presented. It is shown that the speedup of processing divisible loads concurrently on a homogeneous single level tree increases linearly as the number of processors is increased. This behavior is markedly different from that of past research on sequential scheduling where speedup satura...
متن کاملScheduling for Speed Bounded Processors
We consider online scheduling algorithms in the dynamic speed scaling model, where a processor can scale its speed between 0 and some maximum speed T . The processor uses energy at rate s when run at speed s, where α > 1 is a constant. Most modern processors use dynamic speed scaling to manage their energy usage. This leads to the problem of designing execution strategies that are both energy e...
متن کاملEvolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling (FTPS). Since FTPS problems are, in general, computationally di cult, a challenge is to nd e ective scheduling procedures. Three evolution-based algorithms solving three basic kinds of FTPS problems have been proposed. The problems involve scheduling multiple variant tasks on multiple identical proces...
متن کاملInstruction Scheduling with Timing Constraints on Multiple RISC Processors
We present a fast approximation algorithm for scheduling UET(Unit Execution Time) instructions with precedence constraints in the form of a DAG, latency constraints where the latency between any two instructions is a non-negative integer, timing constraints in the form of individual integer release times and deadlines in a basic block on multiple RISC processors. In general case where latencies...
متن کاملOptimal Scheduling of Periodic Tasks on Multiple Identical Processors
We consider the problem of scheduling m periodic tasks on n; n < m; identical processors. Our main contribution is to show that the condition n, where is the total density of the task set, is a suucient condition for scheduling the m tasks such that no deadlines are ever missed. We start with a novel representation of the periodic task scheduling problem as a maximum network ow problem. The str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2015
ISSN: 2329-4949,2329-4957
DOI: 10.1145/2809872